0.12/0.12	% Problem    : Vampire---4.8_29911 : TPTP v0.0.0. Released v0.0.0.
0.12/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n014.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 1440
0.13/0.34	% WCLimit    : 180
0.13/0.34	% DateTime   : Mon Jul  3 12:49:53 EDT 2023
0.13/0.34	% CPUTime    : 
0.20/0.47	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.39aku572Rl/Vampire---4.8_29911
0.20/0.47	# Version: 3.1pre001-ho
0.20/0.49	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting new_ho_9 with 900s (5) cores
0.20/0.49	# Starting post_as_ho1 with 180s (1) cores
0.20/0.49	# Starting sh1l with 180s (1) cores
0.20/0.49	# Starting post_as_ho10 with 180s (1) cores
0.20/0.49	# post_as_ho1 with pid 30090 completed with status 0
0.20/0.49	# Result found by post_as_ho1
0.20/0.49	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting new_ho_9 with 900s (5) cores
0.20/0.49	# Starting post_as_ho1 with 180s (1) cores
0.20/0.49	# No SInE strategy applied
0.20/0.49	# Search class: HGUNF-FFSF11-SHSSMMBN
0.20/0.49	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.49	# Starting ehoh_best2_full_lfho with 98s (1) cores
0.20/0.49	# ehoh_best2_full_lfho with pid 30096 completed with status 0
0.20/0.49	# Result found by ehoh_best2_full_lfho
0.20/0.49	# Preprocessing class: HSSSSMSSMLSNHSN.
0.20/0.49	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.49	# Starting new_ho_9 with 900s (5) cores
0.20/0.49	# Starting post_as_ho1 with 180s (1) cores
0.20/0.49	# No SInE strategy applied
0.20/0.49	# Search class: HGUNF-FFSF11-SHSSMMBN
0.20/0.49	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.49	# Starting ehoh_best2_full_lfho with 98s (1) cores
0.20/0.49	# Preprocessing time       : 0.001 s
0.20/0.49	
0.20/0.49	# Proof found!
0.20/0.49	# SZS status Theorem
0.20/0.49	# SZS output start CNFRefutation
0.20/0.49	thf(decl_22, type, subrel: ($i > $i > $o) > ($i > $i > $o) > $o).
0.20/0.49	thf(decl_34, type, trans: ($i > $i > $o) > $o).
0.20/0.49	thf(decl_35, type, tc: ($i > $i > $o) > $i > $i > $o).
0.20/0.49	thf(decl_41, type, term: ($i > $i > $o) > $o).
0.20/0.49	thf(decl_42, type, ind: ($i > $i > $o) > $o).
0.20/0.49	thf(decl_51, type, epred1_0: $i > $i > $o).
0.20/0.49	thf(decl_52, type, esk1_1: ($i > $o) > $i).
0.20/0.49	thf(decl_53, type, epred2_2: ($i > $o) > $i > $i > $i > $o).
0.20/0.49	thf(decl_54, type, epred3_0: $i > $o).
0.20/0.49	thf(decl_55, type, esk2_0: $i).
0.20/0.49	thf(decl_56, type, esk3_1: $i > $i).
0.20/0.49	thf(transitive_closure, axiom, ((tc)=(^[X1:$i > $i > $o, X3:$i, X4:$i]:(![X2:$i > $i > $o]:((((trans @ X2)&(subrel @ X1 @ X2))=>(X2 @ X3 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.39aku572Rl/Vampire---4.8_29911', transitive_closure)).
0.20/0.49	thf(subrel, axiom, ((subrel)=(^[X1:$i > $i > $o, X2:$i > $i > $o]:(![X3:$i, X4:$i]:(((X1 @ X3 @ X4)=>(X2 @ X3 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.39aku572Rl/Vampire---4.8_29911', subrel)).
0.20/0.49	thf(transitive, axiom, ((trans)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X6))=>(X1 @ X3 @ X6)))))), file('/export/starexec/sandbox/tmp/tmp.39aku572Rl/Vampire---4.8_29911', transitive)).
0.20/0.49	thf(satisfying_the_induction_principle, axiom, ((ind)=(^[X1:$i > $i > $o]:(![X8:$i > $o]:((![X3:$i]:((![X4:$i]:(((tc @ X1 @ X3 @ X4)=>(X8 @ X4)))=>(X8 @ X3)))=>![X3:$i]:((X8 @ X3))))))), file('/export/starexec/sandbox/tmp/tmp.39aku572Rl/Vampire---4.8_29911', satisfying_the_induction_principle)).
0.20/0.49	thf(terminating, axiom, ((term)=(^[X1:$i > $i > $o]:(![X7:$i > $o]:((?[X3:$i]:((X7 @ X3))=>?[X3:$i]:(((X7 @ X3)&![X4:$i]:(((X7 @ X4)=>~((X1 @ X3 @ X4))))))))))), file('/export/starexec/sandbox/tmp/tmp.39aku572Rl/Vampire---4.8_29911', terminating)).
0.20/0.49	thf(induction_implies_termination, conjecture, ![X1:$i > $i > $o]:(((ind @ X1)=>(term @ X1))), file('/export/starexec/sandbox/tmp/tmp.39aku572Rl/Vampire---4.8_29911', induction_implies_termination)).
0.20/0.49	thf(c_0_6, plain, ((tc)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i, Z2:$i]:(![X2:$i > $i > $o]:((((![X16:$i, X17:$i, X18:$i]:((((X2 @ X16 @ X17)&(X2 @ X17 @ X18))=>(X2 @ X16 @ X18))))&(![X19:$i, X20:$i]:(((Z0 @ X19 @ X20)=>(X2 @ X19 @ X20)))))=>(X2 @ Z1 @ Z2)))))), inference(fof_simplification,[status(thm)],[transitive_closure])).
0.20/0.49	thf(c_0_7, plain, ((subrel)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $i > $o]:(![X3:$i, X4:$i]:(((Z0 @ X3 @ X4)=>(Z1 @ X3 @ X4)))))), inference(fof_simplification,[status(thm)],[subrel])).
0.20/0.49	thf(c_0_8, plain, ((trans)=(^[Z0/* 6 */:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((Z0 @ X3 @ X4)&(Z0 @ X4 @ X6))=>(Z0 @ X3 @ X6)))))), inference(fof_simplification,[status(thm)],[transitive])).
0.20/0.49	thf(c_0_9, plain, ((ind)=(^[Z0/* 6 */:$i > $i > $o]:(![X8:$i > $o]:((![X3:$i]:((![X4:$i]:(((![X44:$i > $i > $o]:((((![X45:$i, X46:$i, X47:$i]:((((X44 @ X45 @ X46)&(X44 @ X46 @ X47))=>(X44 @ X45 @ X47))))&(![X48:$i, X49:$i]:(((Z0 @ X48 @ X49)=>(X44 @ X48 @ X49)))))=>(X44 @ X3 @ X4))))=>(X8 @ X4)))=>(X8 @ X3)))=>![X3:$i]:((X8 @ X3))))))), inference(fof_simplification,[status(thm)],[satisfying_the_induction_principle])).
0.20/0.49	thf(c_0_10, plain, ((tc)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i, Z2:$i]:(![X2:$i > $i > $o]:((((![X16:$i, X17:$i, X18:$i]:((((X2 @ X16 @ X17)&(X2 @ X17 @ X18))=>(X2 @ X16 @ X18))))&(![X19:$i, X20:$i]:(((Z0 @ X19 @ X20)=>(X2 @ X19 @ X20)))))=>(X2 @ Z1 @ Z2)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6, c_0_7]), c_0_8])).
0.20/0.49	thf(c_0_11, plain, ((term)=(^[Z0/* 6 */:$i > $i > $o]:(![X7:$i > $o]:((?[X3:$i]:((X7 @ X3))=>?[X3:$i]:(((X7 @ X3)&![X4:$i]:(((X7 @ X4)=>~((Z0 @ X3 @ X4))))))))))), inference(fof_simplification,[status(thm)],[terminating])).
0.20/0.49	thf(c_0_12, plain, ((ind)=(^[Z0/* 6 */:$i > $i > $o]:(![X8:$i > $o]:((![X3:$i]:((![X4:$i]:(((![X44:$i > $i > $o]:((((![X45:$i, X46:$i, X47:$i]:((((X44 @ X45 @ X46)&(X44 @ X46 @ X47))=>(X44 @ X45 @ X47))))&(![X48:$i, X49:$i]:(((Z0 @ X48 @ X49)=>(X44 @ X48 @ X49)))))=>(X44 @ X3 @ X4))))=>(X8 @ X4)))=>(X8 @ X3)))=>![X3:$i]:((X8 @ X3))))))), inference(apply_def,[status(thm)],[c_0_9, c_0_10])).
0.20/0.49	thf(c_0_13, negated_conjecture, ~(![X1:$i > $i > $o]:((![X158:$i > $o]:((![X159:$i]:((![X160:$i]:((![X161:$i > $i > $o]:(((![X162:$i, X163:$i, X164:$i]:((((X161 @ X162 @ X163)&(X161 @ X163 @ X164))=>(X161 @ X162 @ X164)))&![X165:$i, X166:$i]:(((X1 @ X165 @ X166)=>(X161 @ X165 @ X166))))=>(X161 @ X159 @ X160)))=>(X158 @ X160)))=>(X158 @ X159)))=>![X167:$i]:((X158 @ X167))))=>![X168:$i > $o]:((?[X169:$i]:((X168 @ X169))=>?[X170:$i]:(((X168 @ X170)&![X171:$i]:(((X168 @ X171)=>~(X1 @ X170 @ X171)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[induction_implies_termination]), c_0_11]), c_0_12])])).
0.20/0.49	thf(c_0_14, negated_conjecture, ![X173:$i > $o, X175:$i, X177:$i, X178:$i, X179:$i, X180:$i, X181:$i, X182:$i, X185:$i]:((((((~(epred2_2 @ X173 @ X175 @ X177 @ X178)|~(epred2_2 @ X173 @ X175 @ X178 @ X179)|(epred2_2 @ X173 @ X175 @ X177 @ X179)|(X173 @ X175)|(X173 @ X182))&(~(epred1_0 @ X180 @ X181)|(epred2_2 @ X173 @ X175 @ X180 @ X181)|(X173 @ X175)|(X173 @ X182)))&(~(epred2_2 @ X173 @ X175 @ (esk1_1 @ X173) @ X175)|(X173 @ X175)|(X173 @ X182)))&(~(X173 @ (esk1_1 @ X173))|(X173 @ X182)))&((epred3_0 @ esk2_0)&(((epred3_0 @ (esk3_1 @ X185))|~(epred3_0 @ X185))&((epred1_0 @ X185 @ (esk3_1 @ X185))|~(epred3_0 @ X185)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])])).
0.20/0.49	thf(c_0_15, negated_conjecture, ![X3:$i, X6:$i, X10:$i, X7:$i > $o, X4:$i]:(((epred2_2 @ X7 @ X6 @ X3 @ X4)|(X7 @ X6)|(X7 @ X10)|~((epred1_0 @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.49	thf(c_0_16, negated_conjecture, ![X3:$i]:(((epred1_0 @ X3 @ (esk3_1 @ X3))|~((epred3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.49	thf(c_0_17, negated_conjecture, ![X3:$i, X7:$i > $o]:(((X7 @ X3)|~((X7 @ (esk1_1 @ X7))))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.49	thf(c_0_18, negated_conjecture, ![X7:$i > $o, X4:$i, X3:$i]:(((X7 @ X3)|(X7 @ X4)|~((epred2_2 @ X7 @ X3 @ (esk1_1 @ X7) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.49	thf(c_0_19, negated_conjecture, ![X3:$i, X7:$i > $o, X6:$i, X4:$i]:(((epred2_2 @ X7 @ X3 @ X4 @ (esk3_1 @ X4))|(X7 @ X6)|(X7 @ X3)|~((epred3_0 @ X4)))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
0.20/0.49	thf(c_0_20, negated_conjecture, ![X7:$i > $o, X3:$i]:(((X7 @ (esk1_1 @ (^[Z0/* 7 */:$i]:(~((X7 @ Z0))))))|~((X7 @ X3)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_17])).
0.20/0.49	thf(c_0_21, negated_conjecture, (epred3_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.49	thf(c_0_22, negated_conjecture, ![X3:$i, X4:$i, X7:$i > $o]:(((X7 @ (esk3_1 @ (esk1_1 @ X7)))|(X7 @ X3)|(X7 @ X4)|~((epred3_0 @ (esk1_1 @ X7))))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.49	thf(c_0_23, negated_conjecture, (epred3_0 @ (esk1_1 @ (^[Z0/* 7 */:$i]:(~((epred3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.20/0.49	thf(c_0_24, negated_conjecture, ![X3:$i, X4:$i]:((~((epred3_0 @ (esk3_1 @ (esk1_1 @ (^[Z0/* 7 */:$i]:(~((epred3_0 @ Z0))))))))|~((epred3_0 @ X3))|~((epred3_0 @ X4)))), inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23])])).
0.20/0.49	thf(c_0_25, negated_conjecture, ![X3:$i]:(((epred3_0 @ (esk3_1 @ X3))|~((epred3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.49	thf(c_0_26, negated_conjecture, ![X3:$i, X4:$i]:((~((epred3_0 @ X3))|~((epred3_0 @ X4)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_23])])).
0.20/0.49	thf(c_0_27, negated_conjecture, ![X3:$i]:(~((epred3_0 @ X3))), inference(spm,[status(thm)],[c_0_26, c_0_21])).
0.20/0.49	thf(c_0_28, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_21, c_0_27]), ['proof']).
0.20/0.49	# SZS output end CNFRefutation
0.20/0.49	# Parsed axioms                        : 59
0.20/0.49	# Removed by relevancy pruning/SinE    : 0
0.20/0.49	# Initial clauses                      : 36
0.20/0.49	# Removed in clause preprocessing      : 29
0.20/0.49	# Initial clauses in saturation        : 7
0.20/0.49	# Processed clauses                    : 40
0.20/0.49	# ...of these trivial                  : 2
0.20/0.49	# ...subsumed                          : 7
0.20/0.49	# ...remaining for further processing  : 31
0.20/0.49	# Other redundant clauses eliminated   : 8
0.20/0.49	# Clauses deleted for lack of memory   : 0
0.20/0.49	# Backward-subsumed                    : 11
0.20/0.49	# Backward-rewritten                   : 0
0.20/0.49	# Generated clauses                    : 108
0.20/0.49	# ...of the previous two non-redundant : 86
0.20/0.49	# ...aggressively subsumed             : 0
0.20/0.49	# Contextual simplify-reflections      : 0
0.20/0.49	# Paramodulations                      : 47
0.20/0.49	# Factorizations                       : 0
0.20/0.49	# NegExts                              : 3
0.20/0.49	# Equation resolutions                 : 9
0.20/0.49	# Total rewrite steps                  : 3
0.20/0.49	# Propositional unsat checks           : 0
0.20/0.49	#    Propositional check models        : 0
0.20/0.49	#    Propositional check unsatisfiable : 0
0.20/0.49	#    Propositional clauses             : 0
0.20/0.49	#    Propositional clauses after purity: 0
0.20/0.49	#    Propositional unsat core size     : 0
0.20/0.49	#    Propositional preprocessing time  : 0.000
0.20/0.49	#    Propositional encoding time       : 0.000
0.20/0.49	#    Propositional solver time         : 0.000
0.20/0.49	#    Success case prop preproc time    : 0.000
0.20/0.49	#    Success case prop encoding time   : 0.000
0.20/0.49	#    Success case prop solver time     : 0.000
0.20/0.49	# Current number of processed clauses  : 15
0.20/0.49	#    Positive orientable unit clauses  : 2
0.20/0.49	#    Positive unorientable unit clauses: 0
0.20/0.49	#    Negative unit clauses             : 3
0.20/0.49	#    Non-unit-clauses                  : 10
0.20/0.49	# Current number of unprocessed clauses: 53
0.20/0.49	# ...number of literals in the above   : 186
0.20/0.49	# Current number of archived formulas  : 0
0.20/0.49	# Current number of archived clauses   : 16
0.20/0.49	# Clause-clause subsumption calls (NU) : 53
0.20/0.49	# Rec. Clause-clause subsumption calls : 41
0.20/0.49	# Non-unit clause-clause subsumptions  : 5
0.20/0.49	# Unit Clause-clause subsumption calls : 12
0.20/0.49	# Rewrite failures with RHS unbound    : 0
0.20/0.49	# BW rewrite match attempts            : 1
0.20/0.49	# BW rewrite match successes           : 1
0.20/0.49	# Condensation attempts                : 0
0.20/0.49	# Condensation successes               : 0
0.20/0.49	# Termbank termtop insertions          : 5852
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.008 s
0.20/0.49	# System time              : 0.004 s
0.20/0.49	# Total time               : 0.012 s
0.20/0.49	# Maximum resident set size: 2140 pages
0.20/0.49	
0.20/0.49	# -------------------------------------------------
0.20/0.49	# User time                : 0.009 s
0.20/0.49	# System time              : 0.007 s
0.20/0.49	# Total time               : 0.016 s
0.20/0.49	# Maximum resident set size: 1772 pages
0.20/0.49	% E---3.1 exiting
0.20/0.49	EOF